package com.wyp168.leetcode;

/**
 * @ClassName JobSchedulingSolution
 * @Title TODO leetcode 1235 规划兼职工作 [Hard]
 * @Description TODO
 * @Author wyp168
 * @Date 2022/10/22 08:55
 */
public class JobSchedulingSolution {
    public static void main(String[] args) {

    }

    public int jobScheduling(int[] startTime, int[] endTime, int[] profit) {
        int length = startTime.length;
        int[] dp = new int[length];
        int[] currDate = new int[2];
        currDate[0] = startTime[0];
        currDate[1] = endTime[1];
        dp[0] = profit[0];
        for (int i = 1; i < length; i++) {
            dp[i] = Math.max(dp[i - 1], dp[i - 1] + profit[i]);
        }
        return 0;
    }
}
